Reconstructing a Semantics for Action Rules by a Transformation to Almost Plain Prolog

Action Rules are currently only implemented by B-Prolog. One reason is that it is difficult to extract their exact semantics from the manual or the implementation. This issue is attacked by describing a transformation from Action Rules to almost plain Prolog. The transformation captures most of the B-Prolog semantics, and shows clearly how it could be extended. It also allows for an easy to understand source level description of many optimizations. Reconstructing a Semantics for Action Rules by a Transformation to Almost Plain Prolog Bart Demoen∗ and Phuong-Lan Nguyen† ∗ Department of Computer Science, K.U.Leuven, Belgium [email protected] † Institut de Mathématiques Appliquées, UCO, Angers, France [email protected] Abstract. Action Rules are currently only implemented by B-Prolog. One reason is that it is difficult to extract their exact semantics from the manual or the implementation. This issue is attacked by describing a transformation from Action Rules to almost plain Prolog. The transformation captures most of the B-Prolog semantics, and shows clearly how it could be extended. It also allows for an easy to understand source level description of many optimizations. Action Rules are currently only implemented by B-Prolog. One reason is that it is difficult to extract their exact semantics from the manual or the implementation. This issue is attacked by describing a transformation from Action Rules to almost plain Prolog. The transformation captures most of the B-Prolog semantics, and shows clearly how it could be extended. It also allows for an easy to understand source level description of many optimizations.